Extending Classical Planning with State Constraints: Heuristics and Search for Optimal Planning
نویسندگان
چکیده
منابع مشابه
Extending Classical Planning Heuristics to Probabilistic Planning with Dead-Ends
Recent domain-determinization techniques have been very successful in many probabilistic planning problems. We claim that traditional heuristic MDP algorithms have been unsuccessful due mostly to the lack of efficient heuristics in structured domains. Previous attempts like mGPT used classical planning heuristics to an all-outcome determinization of MDPs without discount factor ; yet, discounte...
متن کاملTuning Search Heuristics for Classical Planning with Macro Actions
This paper proposes a new approach to improve domain independent heuristic state space search planners for classical planning by tuning the search heuristics using macro actions of length two extracted from sample plans. This idea is implemented in the planner AltAlt and the new planner Macro-AltAlt is tested on the domains introduced for the learning track of the International Planning Competi...
متن کاملOptimal Planning with Global Numerical State Constraints
Automating the operations of infrastructure networks such as energy grids and oil pipelines requires a range of planning and optimisation technologies. However, current planners face significant challenges in responding to this need. Notably, they are unable to model and reason about the global numerical state constraints necessary to capture flows and similar physical phenomena occurring in th...
متن کاملHeuristics for Cost-Optimal Classical Planning Based on Linear Programming
Many heuristics for cost-optimal planning are based on linear programming. We cover several interesting heuristics of this type by a common framework that fixes the objective function of the linear program. Within the framework, constraints from different heuristics can be combined in one heuristic estimate which dominates the maximum of the component heuristics. Different heuristics of the fra...
متن کاملHigher-Dimensional Potential Heuristics for Optimal Classical Planning
Potential heuristics for state-space search are defined as weighted sums over simple state features. Atomic features consider the value of a single state variable in a factored state representation, while binary features consider joint assignments to two state variables. Previous work showed that the set of all admissible and consistent potential heuristics using atomic features can be characte...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2018
ISSN: 1076-9757
DOI: 10.1613/jair.1.11213